On a Vizing-like conjecture for direct product graphs
نویسندگان
چکیده
Let (G) be the domination number of a graph G, and let G H be the direct product of graphs G and H. It is shown that for any k 0 there exists a graph G such that (G G) (G) 2 ? k. This in particular disproves a conjecture from 5].
منابع مشابه
Total coloring of corona product of two graphs
A total coloring of a graph is an assignment of colors to all the elements (vertices and edges) of the graph such that no two adjacent or incident elements receive the same color. In this paper, we prove the tight bound of the Behzad and Vizing conjecture on total coloring for the corona product of two graphs G and H , when H is a cycle, a complete graph or a bipartite graph.
متن کاملImproving some bounds for dominating Cartesian products
The study of domination in Cartesian products has received its main motivation from attempts to settle a conjecture made by V.G. Vizing in 1968. He conjectured that γ(G)γ(H) is a lower bound for the domination number of the Cartesian product of any two graphs G and H. Most of the progress on settling this conjecture has been limited to verifying the conjectured lower bound if one of the graphs ...
متن کاملVizing's Conjecture for Graphs with Domination Number 3 - a New Proof
Vizing’s conjecture from 1968 asserts that the domination number of the Cartesian product of two graphs is at least as large as the product of their domination numbers. In this note we use a new, transparent approach to prove Vizing’s conjecture for graphs with domination number 3; that is, we prove that for any graph G with γ(G) = 3 and an arbitrary graph H, γ(G H) > 3γ(H).
متن کاملOn outer-connected domination for graph products
An outer-connected dominating set for an arbitrary graph G is a set D̃ ⊆ V such that D̃ is a dominating set and the induced subgraph G[V \ D̃] be connected. In this paper, we focus on the outerconnected domination number of the product of graphs. We investigate the existence of outer-connected dominating set in lexicographic product and Corona of two arbitrary graphs, and we present upper bounds f...
متن کاملApproximating Vizing's independence number conjecture
In 1965, Vizing conjectured that the independence ratio of edge-chromatic critical graphs is at most 1 2 . We prove that for every > 0 this conjecture is equivalent to its restriction on a specific set of edge-chromatic critical graphs with independence ratio smaller than 1 2 + .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 156 شماره
صفحات -
تاریخ انتشار 1996